A First-Order Representation of Stable Models

نویسندگان

  • Thomas Eiter
  • James J. Lu
  • V. S. Subrahmanian
چکیده

Turi (1991) introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a constrained interpretation. We investigate how non-ground representations of both the stable model semantics and the well-founded semantics may be obtained through Turi’s approach. The practical implication of this is that the wellfounded model (or the set of stable models) may be partially pre-computed at compile-time, resulting in the association of each predicate symbol in the program to a constrained atom. Algorithms to create such models are presented, both for the well founded case, and the case of stable models. Query processing reduces to checking whether each atom in the query is true in a stable model (resp. well-founded model). This amounts to showing the atom is an instance of one of some constrained atom whose associated constraint is solvable. Various related complexity results are explored, and the impacts of these results are discussed from the point of view of implementing systems that incorporate the stable and well-founded semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pure First Order Representation for Undamped Second Order Descriptor Systems

The aim of this paper is to analyze the undamped second order descriptor systems to show the possibility of transform an undamped second order descriptor system to a pure first order descriptor system ,on different ways, while stating some of its benefits. Meanwhile we will introduce pure first order systems and undamped second order systems and indicate that under some assumptions every undamp...

متن کامل

استفاده از نمایش پراکنده و همکاری دوربین‌ها برای کاربردهای نظارت بینایی

With the growth of demand for security and safety, video-based surveillance systems have been employed in a large number of rural and urban areas. The problem of such systems lies in the detection of patterns of behaviors in a dataset that do not conform to normal behaviors. Recently, for behavior classification and abnormal behavior detection, the sparse representation approach is used. In thi...

متن کامل

A Joint Semantic Vector Representation Model for Text Clustering and Classification

Text clustering and classification are two main tasks of text mining. Feature selection plays the key role in the quality of the clustering and classification results. Although word-based features such as term frequency-inverse document frequency (TF-IDF) vectors have been widely used in different applications, their shortcoming in capturing semantic concepts of text motivated researches to use...

متن کامل

Implicit One-step L-stable Generalized Hybrid Methods for the Numerical Solution of First Order Initial Value problems

In this paper, we introduce the new class of implicit L-stable generalized hybrid methods for the numerical solution of first order initial value problems. We generalize the hybrid methods with utilize ynv directly in the right hand side of classical hybrid methods. The numerical experimentation showed that our method is considerably more efficient compared to well known methods used for the n...

متن کامل

ON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY

Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • AI Commun.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1998